E cient Probabilistic Inference with Partial Ranking Queries
نویسندگان
چکیده
Distributions over rankings are used to model data in various settings such as preference analysis and political elections. The factorial size of the space of rankings, however, typically forces one to make structural assumptions, such as smoothness, sparsity, or probabilistic independence about these underlying distributions. We approach the modeling problem from the computational principle that one should make structural assumptions which allow for e cient calculation of typical probabilistic queries. For ranking models, typical queries predominantly take the form of partial ranking queries (e.g., given a user's top-k favorite movies, what are his preferences over remaining movies?). In this paper, we argue that ri ed independence factorizations proposed in recent literature [7, 8] are a natural structural assumption for ranking distributions, allowing for particularly efcient processing of partial ranking queries.
منابع مشابه
Efficient Probabilistic Inference with Partial Ranking Queries
Distributions over rankings are used to model data in various settings such as preference analysis and political elections. The factorial size of the space of rankings, however, typically forces one to make structural assumptions, such as smoothness, sparsity, or probabilistic independence about these underlying distributions. We approach the modeling problem from the computational principle th...
متن کاملRiffled Independence for Efficient Inference with Partial Rankings
Distributions over rankings are used to model data in a multitude of real world settings such as preference analysis and political elections. Modeling such distributions presents several computational challenges, however, due to the factorial size of the set of rankings over an item set. Some of these challenges are quite familiar to the artificial intelligence community, such as how to compact...
متن کاملPrivacy-Preserving Text Indexing for Search of Documents
Protection of content of sensitive text documents is important in enterprise intranets. An index structure is needed to support efficient search and retrieval, but it can lead to information leakage; by statistical attacks an adversary can draw probabilistic inference about the contents of document collection. Zerr and others present a confidential index structure and the ranking of retrieved d...
متن کاملAutomatic Differentiation Equipped Variable Elimination for Sensitivity Analysis on Probabilistic Inference Queries
Probabilistic Models are a natural framework for describing the stochastic relation1 ships between variables in a system to perform inference tasks, such as estimating 2 the probability of a specific set of conditions or events. In application it is often 3 appropriate to perform sensitivity analysis on a model, for example, to assess the 4 stability of analytical results with respect to the go...
متن کاملLogarithmic-Time Updates and Queries in Probabilistic Networks
Traditional databases commonly support e cient query and update procedures that operate in time which is sublinear in the size of the database. Our goal in this paper is to take a rst step toward dynamic reasoning in probabilistic databases with comparable e ciency. We propose a dynamic data structure that supports e cient algorithms for updating and querying singly connected Bayesian networks....
متن کامل